Orthogonal F-rectangles, orthogonal arrays, and codes
نویسندگان
چکیده
منابع مشابه
Two-weight codes, graphs and orthogonal arrays
We investigate properties of two-weight codes over finite Frobenius rings, giving constructions for the modular case. A δ-modular code [15] is characterized as having a generator matrix where each column g appears with multiplicity δ|gR×| for some δ ∈ Q. Generalizing [10] and [5], we show that the additive group of a two-weight code satisfying certain constraint equations (and in particular a m...
متن کاملOrthogonal Latin Rectangles
We use a greedy probabilistic method to prove that for every > 0, every m × n Latin rectangle on n symbols has an orthogonal mate, where m = (1− )n. That is, we show the existence of a second latin rectangle such that no pair of the mn cells receives the same pair of symbols in the two rectangles.
متن کاملOn orthogonal generalized equitable rectangles
In this note, we give a complete solution of the existence of orthogonal generalized equitable rectangles, which was raised as an open problem in [4].
متن کاملOrthogonal Arrays
Definition Orthogonal arrays (OAs) are objects that are most often generated via algebraic arguments. They have a number of applications in applied mathematics, and have often been studied by algebraic mathematicians as objects of interest in their own right. Our treatment will reflect their use as representations of statistical experimental designs. An OA is generally presented as a two-dimens...
متن کاملOrthogonal Arrays
(say) is called symmetric, otherwise, the array is said to be asymmetric. Several methods of construction of symmetric as well as asymmetric OAs are available in the literature. Some important methods will be discussed here. One of the principal applications of the OAs is in the selection of level combinations for fractional factorial experiments. An OA of strength t is equivalent to an orthogo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1986
ISSN: 0097-3165
DOI: 10.1016/0097-3165(86)90057-9